An enhanced component connection method for conversion of fault trees to binary decision diagrams
نویسندگان
چکیده
Fault Tree Analysis (FTA) is widely applied to assess the failure probability of industrial systems. Many computer packages are available which are based on conventional Kinetic Tree Theory methods. When dealing with large (possibly non-coherent) fault trees, the limitations of the technique in terms of accuracy of the solutions and the efficiency of the processing time becomes apparent. Over recent years the Binary Decision Diagram (BDD) method has been developed that solves fault trees and overcomes the disadvantages of the conventional FTA approach. First of all, a fault tree for a particular system failure mode is constructed and then converted to a BDD for analysis. This paper analyses alternative methods for the fault tree to BDD conversion process. For most fault tree to BDD conversion approaches the basic events of the fault tree are placed in an ordering. This can dramatically affect the size of the final BDD and the success of qualitative and quantitative analyses of the system. A set of rules are then applied to each gate in the fault tree to generate the BDD. An alternative approach can also be used, where BDD constructs for each of the gate types are first built and then merged to represent a parent gate. A powerful and efficient property, sub-node sharing, is also incorporated in the enhanced method proposed in this paper. Finally a combined approach is developed taking the best features of the alternative methods. The efficiency of the techniques is analysed and discussed.
منابع مشابه
A fault tree analysis strategy using binary decision diagrams
The use of Binary Decision Diagrams (BDDs) in fault tree analysis provides both an accurate and efficient means of analysing a system. There is a problem however, with the conversion process of the fault tree to the BDD. The variable ordering scheme chosen for the construction of the BDD has a crucial effect on its resulting size and previous research has failed to identify any scheme that is c...
متن کاملEvent-tree analysis using binary decision diagrams
and Conclusions This paper is concerned with the analysis of Event Trees where the branch point event causes are defined using Fault Tree structures. Attention is focussed on the non-trivial situation where there are dependencies amongst the branch point events. The dependencies are due to component failure events featuring in one or more of the fault trees. In these situations it is shown that...
متن کاملMinimal cutsets-based reduction approach for the use of binary decision diagrams on probabilistic safety assessment fault tree models
Binary decision diagrams (BDDs) are a well-known alternative to the minimal cutsets (MCS) approach to assess Boolean reliability models. While the application of fault tree analysis can be considered to be consolidated, its application to the event trees involved in the probabilistic safety assessment (PSA) studies of the nuclear industry require extended efforts. For many real PSA models the f...
متن کاملSequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees
Dynamic Fault Trees have focused a large attention in the past few years. By adding new gates to static (regular) Fault Trees, Dynamic Fault Trees aim to take into account the order in which events occur. Lesage & al. proposed recently an algebraic framework to give a formal interpretation to these gates. In this article, we extend Lesage’s work by adopting a slightly different perspective. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Rel. Eng. & Sys. Safety
دوره 93 شماره
صفحات -
تاریخ انتشار 2008